94.2 KB · ⇊ 27 parts · ⤓ Micron 94.2 KB · ⤓ HTML 762.5 KB

layout: Wide · Narrow · Centered

top

In numerical analysis, the local linearization (LL) method is a general strategy for designing numerical integrators for differential equations based on a local (piecewise) linearization of the given equation on consecutive time intervals. The numerical integrators are then iteratively defined as the solution of the resulting piecewise linear equation at the end of each consecutive interval. The LL method has been developed for a variety of equations such as the ordinary, delayed, random and stochastic differential equations. The LL integrators are key component in the implementation of inference methods for the estimation of unknown parameters and unobserved variables of differential equations given time series of (potentially noisy) observations. The LL schemes are ideals to deal with complex models in a variety of fields as neuroscience, finance, forestry management, control engineering, mathematical statistics, etc.

• Background

• High-order local linearization method

• Local linearization scheme

• LL methods for ODEs

• Local linear discretization

• High-order local linear discretizations

• Local linearization schemes

• LL methods for DDEs

• Local linear discretization

• Local linearization schemes

• LL methods for RDEs

• Local Linear discretization

• Local linearization schemes

• Strong LL methods for SDEs

• Local linear discretization

• High-order local linear discretizations

• Local linearization schemes

• Weak LL methods for SDEs

• Local Linear discretization

• Local Linearization schemes

• Historical notes

• References

Differential equations have become an important mathematical tool for describing the time evolution of several phenomenon, e.g., rotation of the planets around the sun, the dynamic of assets prices in the market, the fire of neurons, the propagation of epidemics, etc. However, since the exact solutions of these equations are usually unknown, numerical approximations to them obtained by numerical integrators are necessary. Currently, many applications in engineering and applied sciences focused in dynamical studies demand the developing of efficient numerical integrators that preserve, as much as possible, the dynamics of these equations. With this main motivation, the Local Linearization integrators have been developed.

High-order local linearization (HOLL) method is a generalization of the Local Linearization method oriented to obtain high-order integrators for differential equations that preserve the stability and dynamics of the linear equations. The integrators are obtained by splitting, on consecutive time intervals, the solution x of the original equation in two parts: the solution z of the locally linearized equation plus a high-order approximation of the residual r = x − z {\displaystyle \mathbf {r} =\mathbf {x} -\mathbf {z} } .

A Local Linearization (LL) scheme is the final recursive algorithm that allows the numerical implementation of a discretization derived from the LL or HOLL method for a class of differential equations.

Consider the d-dimensional Ordinary Differential Equation (ODE)

d x ( t ) d t = f ( t , x ( t ) ) , t ∈ [ t 0 , T ] , ( 4.1 ) {\displaystyle {\frac {d\mathbf {x} \left(t\right)}{dt}}=\mathbf {f} \left(t,\mathbf {x} \left(t\right)\right),\qquad t\in \left[t_{0},T\right],\qquad \qquad \qquad \qquad (4.1)}

with initial condition x ( t 0 ) = x 0 {\displaystyle \mathbf {x} (t_{0})=\mathbf {x} _{0}} , where f {\displaystyle \mathbf {f} } is a differentiable function.

Let ( t ) h = { t n : n = 0 , . . , N } {\displaystyle \left(t\right)_{h}=\{t_{n}:n=0,..,N\}} be a time discretization of the time interval [ t 0 , T ] {\displaystyle [t_{0},T]} with maximum stepsize h such that t n < t n + 1 {\displaystyle t_{n}<t_{n+1}} and h n = t n + 1 − t n ≤ h {\displaystyle h_{n}=t_{n+1}-t_{n}\leq h} . After the local linearization of the equation (4.1) at the time step t n {\displaystyle t_{n}} the variation of constants formula yields

x ( t n + h ) = x ( t n ) + ϕ ( t n , x ( t n ) ; h ) + r ( t n , x ( t n ) ; h ) , {\displaystyle \mathbf {x} (t_{n}+h)=\mathbf {x} (t_{n})+\mathbf {\phi } (t_{n},\mathbf {x} (t_{n});h)+\mathbf {r} (t_{n},\mathbf {x} (t_{n});h),}

where

ϕ ( t n , z n ; h ) = ∫ 0 h e f x ( t n , z n ) ( h − s ) ( f ( t n , z n ) + f t ( t n , z n ) s ) d s {\displaystyle \mathbf {\phi } (t_{n},\mathbf {z} _{n};h)=\int \limits _{0}^{h}e^{\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})(h-s)}(\mathbf {f} (t_{n},\mathbf {z} _{n})+\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})s)\,ds\qquad }

results from the linear approximation, and

r ( t n , z n ; h ) = ∫ 0 h e f x ( t n , z n ) ( h − s ) g n ( s , x ( t n + s ) ) d s , ( 4.2 ) {\displaystyle \mathbf {r} (t_{n},\mathbf {z} _{n};h)=\int \limits _{0}^{h}e^{\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})(h-s)}\mathbf {g} _{n}(s,\mathbf {x} (t_{n}+s))\,ds,\qquad \qquad \qquad (4.2)}

is the residual of the linear approximation. Here, f x {\displaystyle \mathbf {f} _{\mathbf {x} }} and f t {\displaystyle \mathbf {f} _{t}} denote the partial derivatives of f with respect to the variables x and t, respectively, and g n ( s , u ) = f ( s , u ) − f x ( t n , z n ) u − f t ( t n , z n ) ( s − t n ) − f ( t n , z n ) + f x ( t n , z n ) z n . {\displaystyle \mathbf {g} _{n}(s,\mathbf {u} )=\mathbf {f} (s,\mathbf {u} )-\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})\mathbf {u} -\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})(s-t_{n})-\mathbf {f} (t_{n},\mathbf {z} _{n})+\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})\mathbf {z} _{n}.}

For a time discretization ( t ) h {\displaystyle \left(t\right)_{h}} , the Local Linear discretization of the ODE (4.1) at each point t n + 1 ∈ ( t ) h {\displaystyle t_{n+1}\in \left(t\right)_{h}} is defined by the recursive expression cite-ref-8-1-0[1]cite-ref-18-2-0[2]

z n + 1 = z n + ϕ ( t n , z n ; h n ) , with z 0 = x 0 . ( 4.3 ) {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h_{n}),\qquad {\text{ with }}\quad \mathbf {z} _{0}=\mathbf {x} _{0}.\qquad \qquad \qquad \qquad (4.3)}

The Local Linear discretization (4.3) converges with order 2 to the solution of nonlinear ODEs, but it match the solution of the linear ODEs. The recursion (4.3) is also known as Exponential Euler discretization.cite-ref-22-3-0[3]

For a time discretization ( t ) h , {\displaystyle (t)_{h},} a high-order local linear (HOLL) discretization of the ODE (4.1) at each point t n + 1 ∈ ( t ) h {\displaystyle t_{n+1}\in (t)_{h}} is defined by the recursive expression cite-ref-8-1-1[1]cite-ref-3-4-0[4]cite-ref-2-5-0[5]cite-ref-1-6-0[6]

z n + 1 = z n + ϕ ( t n , z n ; h n ) + r ~ ( t n , z n ; h n ) , with z 0 = x 0 , ( 4.4 ) {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h_{n})+{\widetilde {\mathbf {r} }}(t_{n},\mathbf {z} _{n};h_{n}),\qquad {\text{ with }}\quad \mathbf {z} _{0}=\mathbf {x} _{0},\qquad \qquad \qquad (4.4)}

where r ~ {\displaystyle {\tilde {r}}} is an order α {\displaystyle \alpha } (> 2) approximation to the residual r ( i . e . , | r ( t n , z n ; h ) − r ~ ( t n , z n ; h ) | ∝ h α + 1 ) . {\displaystyle (i.e.,\left\vert \mathbf {r} (t_{n},\mathbf {z} _{n};h)-{\widetilde {\mathbf {r} }}(t_{n},\mathbf {z} _{n};h)\right\vert \propto h^{\alpha +1}).} The HOLL discretization (4.4) converges with order α {\displaystyle \alpha } to the solution of nonlinear ODEs, but it match the solution of the linear ODEs.

HOLL discretizations can be derived in two ways:cite-ref-8-1-2[1]cite-ref-3-4-1[4]cite-ref-2-5-1[5]cite-ref-1-6-1[6] 1) (quadrature-based) by approximating the integral representation (4.2) of r; and 2) (integrator-based) by using a numerical integrator for the differential representation of r defined by

d r ( t ) d t = q ( t n , z n ; t , r ( t ) ) , with r ( t n ) = 0 , ( 4.5 ) {\displaystyle {\frac {d\mathbf {r} (t)}{dt}}=\mathbf {q} (t_{n},\mathbf {z} _{n};t\mathbf {,\mathbf {r} } (t)\mathbf {)} ,\qquad {\text{ with }}\qquad \mathbf {r} (t_{n})=\mathbf {0,} \qquad \qquad \qquad (4.5)}

for all t ∈ [ t k , t k + 1 ] {\displaystyle t\in \lbrack t_{k},t_{k+1}]} , where

q ( t n , z n ; s , ξ ) = f ( s , z n + ϕ ( t n , z n ; s − t n ) + ξ ) − f x ( t n , z n ) ϕ ( t n , z n ; s − t n ) − f t ( t n , z n ) ( s − t n ) − f ( t n , z n ) . {\displaystyle \mathbf {q} (t_{n},\mathbf {z} _{n};s\mathbf {,\xi } )=\mathbf {f} (s,\mathbf {z} _{n}+\mathbf {\phi } \left(t_{n},\mathbf {z} _{n};s-t_{n}\right)+\mathbf {\xi } )-\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})\mathbf {\phi } (t_{n},\mathbf {z} _{n};s-t_{n})-\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})(s-t_{n})-\mathbf {f} (t_{n},\mathbf {z} _{n}).}

HOLL discretizations are, for instance, the followings:

• Locally Linearized Runge Kutta discretizationcite-ref-1-6-2[6]cite-ref-3-4-2[4]

z n + 1 = z n + ϕ ( t n , z n ; h n ) + h n ∑ j = 1 s b j k j , with k i = q ( t n , z n ; t n + c i h n , h n ∑ j = 1 i − 1 a i j k j ) , {\displaystyle \qquad \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h_{n})+h_{n}\sum _{j=1}^{s}b_{j}\mathbf {k} _{j},\quad {\text{ with }}\quad \mathbf {k} _{i}=\mathbf {q} (t_{n},\mathbf {z} _{n};{\text{ }}t_{n}+c_{i}h_{n}\mathbf {,} \mathbf {} h_{n}\sum _{j=1}^{i-1}a_{ij}\mathbf {k} _{j}),}

which is obtained by solving (4.5) via a s-stage explicit Runge–Kutta (RK) scheme with coefficients c = [ c i ] , A = [ a i j ] a n d b = [ b j ] {\displaystyle \mathbf {c} =\left[c_{i}\right],\mathbf {A} =\left[a_{ij}\right]\quad and\quad \mathbf {b} =\left[b_{j}\right]} .

• Local linear Taylor discretizationcite-ref-2-5-2[5]

z n + 1 = z n + ϕ ( t n , z n ; h n ) + ∫ 0 h n e ( h n − s ) f x ( t n , z n ) ∑ j = 2 p c n , j j ! s j d s , with c n , j = ( d j + 1 x ( t ) d t j + 1 − f x ( t n , z n ) d j x ( t ) d t j ) ∣ t = z n , {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h_{n})+\int _{0}^{h_{n}}e^{(h_{n}-s)\mathbf {f} _{\mathbf {x} }\left(t_{n},\mathbf {z} _{n}\right)}\sum _{j=2}^{p}{\frac {\mathbf {c} _{n,j}}{j!}}s^{j}\,ds,{\text{ with }}\mathbf {c} _{n,j}=\left({\frac {d^{j+1}\mathbf {x} (t)}{dt^{j+1}}}-\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n}){\frac {d^{j}\mathbf {x} (t)}{dt^{j}}}\right)\mid _{t=\mathbf {z} _{n}},}

which results from the approximation of g n {\displaystyle \mathbf {g} _{n}} in (4.2) by its order-p truncated Taylor expansion.

• Multistep-type exponential propagation discretization

z n + 1 = z n + ϕ ( t n , z n ; h ) + h ∑ j = 0 p − 1 γ j ∇ j g n ( t n , z n ) , w i t h γ j = ( − 1 ) j ∫ 0 1 e ( 1 − θ ) h f x ( t n , z n ) ( − θ j ) d θ , {\textstyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h)+h\sum _{j=0}^{p-1}\gamma _{j}\nabla ^{j}\mathbf {g} _{n}(t_{n},\mathbf {z} _{n}),\quad with\quad \gamma _{j}=(-1)^{j}\int \limits _{0}^{1}e^{(1-\theta )h\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})}\left({\begin{array}{c}-\theta \\j\end{array}}\right)d\theta ,}

which results from the interpolation of g n {\displaystyle \mathbf {g} _{n}} in (4.2) by a polynomial of degree p on t n , … , t n − p + 1 {\displaystyle t_{n},\ldots ,t_{n-p+1}} , where ∇ j g n ( t m , z m ) {\displaystyle \nabla ^{j}\mathbf {g} _{n}(t_{m},\mathbf {z} _{m})} denotes the j-th backward difference of g n ( t m , z m ) {\displaystyle \mathbf {g} _{n}(t_{m},\mathbf {z} _{m})} .

• Runge Kutta type Exponential Propagation discretization cite-ref-17-7-0[7]

z n + 1 = z n + ϕ ( t n , z n ; h ) + h ∑ j = 0 p − 1 γ j , p ∇ j g n ( t n , z n ) , with γ j , p = ∫ 0 1 e ( 1 − θ ) h f x ( t n , z n ) ( θ p j ) d θ , {\textstyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h)+h\sum _{j=0}^{p-1}\gamma _{j,p}\nabla ^{j}\mathbf {g} _{n}(t_{n},\mathbf {z} _{n}),\quad {\text{ with }}\quad \gamma _{j,p}=\int \limits _{0}^{1}e^{(1-\theta )h\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})}\left({\begin{array}{c}\theta p\\j\end{array}}\right)d\theta ,}

which results from the interpolation of g n {\displaystyle \mathbf {g} _{n}} in (4.2) by a polynomial of degree p on t n , … , t n + ( p − 1 ) h / p {\displaystyle t_{n},\ldots ,t_{n}+(p-1)h/p} ,

• Linealized exponential Adams discretizationcite-ref-7-8-0[8]

z n + 1 = z n + ϕ ( t n , z n ; h ) + h ∑ j = 1 p − 1 ∑ l = 1 j γ j + 1 l ∇ l g n ( t n , z n ) , with γ j + 1 = ( − 1 ) j + 1 ∫ 0 1 e ( 1 − θ ) h f x ( t n , z n ) θ ( − θ j ) d θ , {\textstyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h)+h\sum _{j=1}^{p-1}\sum _{l=1}^{j}{\frac {\gamma _{j+1}}{l}}\nabla ^{l}\mathbf {g} _{n}(t_{n},\mathbf {z} _{n}),\quad {\text{ with }}\quad \gamma _{j+1}=(-1)^{j+1}\int \limits _{0}^{1}e^{(1-\theta )h\mathbf {f} _{\mathbf {x} }\left(t_{n},\mathbf {z} _{n}\right)}\theta \left({\begin{array}{c}-\theta \\j\end{array}}\right)d\theta ,}

which results from the interpolation of g n {\displaystyle \mathbf {g} _{n}} in (4.2) by a Hermite polynomial of degree p on t n , … , t n − p + 1 {\displaystyle t_{n},\ldots ,t_{n-p+1}} .

All numerical implementation y n {\displaystyle \mathbf {y} _{n}} of the LL (or of a HOLL) discretization z n {\displaystyle \mathbf {z} _{n}} involves approximations ϕ ~ j {\displaystyle {\widetilde {\phi }}_{j}} to integrals ϕ j {\displaystyle \phi _{j}} of the form

ϕ j ( A , h ) = ∫ 0 h e ( h − s ) A s j − 1 d s , j = 1 , 2 … , {\displaystyle \phi _{j}(\mathbf {A} ,h)=\int \limits _{0}^{h}e^{(h-s)\mathbf {A} }s^{j-1}\,ds,\qquad j=1,2\ldots ,}

where A is a d × d matrix. Every numerical implementation y n {\displaystyle \mathbf {y} _{n}} of the LL (or of a HOLL) z n {\displaystyle \mathbf {z} _{n}} of any order is generically called Local Linearization scheme.cite-ref-8-1-3[1]cite-ref-25-9-0[9]

Among a number of algorithms to compute the integrals ϕ j {\displaystyle \phi _{j}} , those based on rational Padé and Krylov subspaces approximations for exponential matrix are preferred. For this, a central role is playing by the expressioncite-ref-10[10]cite-ref-2-5-3[5]cite-ref-13-11-0[11]

∑ i = 1 l ϕ i ( A , h ) a i = L e h H r , {\displaystyle \sum \nolimits _{i=1}^{l}\phi _{i}(\mathbf {A} ,h)\mathbf {a} _{i}=\mathbf {L} e^{h\mathbf {H} }\mathbf {r} ,}

where a i {\displaystyle \mathbf {a} _{i}} are d-dimensional vectors,

H = [ A v l v l − 1 ⋯ v 1 0 0 1 ⋯ 0 0 0 0 ⋱ 0 ⋮ ⋮ ⋮ ⋱ 1 0 0 0 ⋯ 0 ] ∈ R ( d + l ) × ( d + l ) , {\displaystyle \mathbf {H} ={\begin{bmatrix}\mathbf {A} &\mathbf {v} _{l}&\mathbf {v} _{l-1}&\cdots &\mathbf {v} _{1}\\\mathbf {0} &\mathbf {0} &1&\cdots &0\\\mathbf {0} &\mathbf {0} &0&\ddots &0\\\vdots &\vdots &\vdots &\ddots &1\\\mathbf {0} &\mathbf {0} &0&\cdots &0\end{bmatrix}}\in \mathbb {R} ^{(d+l)\times (d+l)},}

L = [ I 0 d × l ] {\displaystyle \mathbf {L} =[\mathbf {I} \quad \mathbf {0} _{d\times l}]} , r = [ 0 1 × ( d + l − 1 ) 1 ] ⊺ , {\displaystyle \mathbf {r} =[\mathbf {0} _{1\times (d+l-1)}\quad 1]^{\intercal },} v i = a i ( i − 1 ) ! {\displaystyle \mathbf {v} _{i}=\mathbf {a} _{i}(i-1)!} , being I {\displaystyle \mathbf {I} } the d-dimensional identity matrix.

If P p , q ( 2 − k H h ) {\displaystyle \mathbf {P} _{p,q}(2^{-k}\mathbf {H} h)} denotes the (p; q)-Padé approximation of e 2 − k H h {\displaystyle e^{2^{-k}\mathbf {H} h}} and k is the smallest natural number such that | 2 − k H h | ≤ 1 2 , t h e n {\displaystyle |2^{-k}\mathbf {H} h|\leq {\frac {1}{2}},then} cite-ref-12-12-0[12]cite-ref-25-9-1[9]

| ∑ i = 1 l ϕ i ( A , h ) a i − L ( P p , q ( 2 − k H h ) ) 2 k r | ∝ h p + q + 1 . {\displaystyle \left\vert \sum \nolimits _{i=1}^{l}\phi _{i}(\mathbf {A} ,h)\mathbf {a} _{i}-\mathbf {L} \left(\mathbf {\mathbf {P} } _{p,q}(2^{-k}\mathbf {H} h)\right)^{2^{k}}\mathbf {r} \right\vert \varpropto h^{p+q+1}.}

If k m , k p , q ( h , H , r ) {\displaystyle \mathbf {\mathbf {k} } _{m,k}^{p,q}(h,\mathbf {H} ,\mathbf {r} )} denotes the (m; p; q; k) Krylov-Padé approximation of e h H r {\displaystyle e^{h\mathbf {H} }\mathbf {r} } , then cite-ref-12-12-1[12]

| ∑ i = 1 l ϕ i ( A , h ) a i − L k m , k p , q ( h , H , r ) | ∝ h min ( m , p + q + 1 ) , {\displaystyle \left\vert \sum \nolimits _{i=1}^{l}\phi _{i}(\mathbf {A} ,h)\mathbf {a} _{i}-\mathbf {L\mathbf {k} } _{m,k}^{p,q}(h,\mathbf {H} ,\mathbf {r} )\right\vert \varpropto h^{\min({m,p+q+1})},}

where m ≤ d {\displaystyle m\leq d} is the dimension of the Krylov subspace.

y n + 1 = y n + L ( P p , q ( 2 − k n M n h n ) ) 2 k n r , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r,} } cite-ref-9-13-0[13]cite-ref-25-9-2[9] ( 4.6 ) {\displaystyle \qquad \qquad (4.6)}

where the matrices M n {\displaystyle \mathbf {M} _{n}} , L and r are defined as

M n = [ f x ( t n , y n ) f t ( t n , y n ) f ( t n , y n ) 0 0 1 0 0 0 ] ∈ R ( d + 2 ) × ( d + 2 ) , {\displaystyle \mathbf {M} _{n}={\begin{bmatrix}\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n})&\mathbf {f} _{t}(t_{n},\mathbf {y} _{n})&\mathbf {f} (t_{n},\mathbf {y} _{n})\\0&0&1\\0&0&0\end{bmatrix}}\in \mathbb {R} ^{(d+2)\times (d+2)},}

L = [ I 0 d × 2 ] {\displaystyle \mathbf {L} =\left[{\begin{array}{ll}\mathbf {I} &\mathbf {0} _{d\times 2}\end{array}}\right]} and r ⊺ = [ 0 1 × ( d + 1 ) 1 ] {\displaystyle \mathbf {r} ^{\intercal }=\left[{\begin{array}{ll}\mathbf {0} _{1\times (d+1)}&1\end{array}}\right]} with p + q > 1 {\displaystyle p+q>1} . For large systems of ODEs cite-ref-22-3-1[3]

y n + 1 = y n + L k m n , k n p , q ( h n , M n , r ) , with m n > 2. {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {M} _{n},\mathbf {r} )\mathbf {,} \qquad {\text{ with }}\qquad m_{n}>2.}

y n + 1 = y n + L 1 ( P p , q ( 2 − k n T n h n ) ) 2 k n r 1 , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L} _{1}(\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {T} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r} _{1}\mathbf {,} } cite-ref-2-5-4[5] ( 4.7 ) {\displaystyle \qquad \qquad (4.7)}

where for autonomous ODEs the matrices T n , L 1 {\displaystyle \mathbf {T} _{n},\mathbf {L} _{1}} and r 1 {\displaystyle \mathbf {r} _{1}} are defined as

T n = [ f x ( y n ) ( I ⊗ f ⊺ ( y n ) ) f x x ( y n ) f ( y n ) 0 f ( y n ) 0 0 0 0 0 0 0 1 0 0 0 0 ] ∈ R ( d + 3 ) × ( d + 3 ) , {\displaystyle \mathbf {T} _{n}=\left[{\begin{array}{cccc}\mathbf {f} _{\mathbf {x} }(\mathbf {y} _{n})&(\mathbf {I} \otimes \mathbf {f} ^{\intercal }(\mathbf {y} _{n}))\mathbf {f} _{\mathbf {xx} }(\mathbf {y} _{n})\mathbf {f} (\mathbf {y} _{n})&\mathbf {0} &\mathbf {f} (\mathbf {y} _{n})\\0&0&0&0\\0&0&0&1\\0&0&0&0\end{array}}\right]\in \mathbb {R} ^{(d+3)\times (d+3)},}

L 1 = [ I 0 d × 3 ] a n d r 1 ⊺ = [ 0 1 × ( d + 2 ) 1 ] {\displaystyle \mathbf {L} _{1}=\left[{\begin{array}{ll}\mathbf {I} &\mathbf {0} _{d\times 3}\end{array}}\right]\quad and\quad \mathbf {r} _{1}^{\intercal }=\left[{\begin{array}{ll}\mathbf {0} _{1\times (d+2)}&1\end{array}}\right]} . Here, f x x {\displaystyle \mathbf {f} _{\mathbf {xx} }} denotes the second derivative of f with respect to x, and p + q > 2. For large systems of ODEs

y n + 1 = y n + L k m n , k n p , q ( h n , T n , r ) , with m n > 3. {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {T} _{n},\mathbf {r} )\mathbf {,} \qquad {\text{ with }}\qquad m_{n}>3.}

y n + 1 = y n + u 4 + h n 6 ( 2 k 2 + 2 k 3 + k 4 ) , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {u} _{4}+{\frac {h_{n}}{6}}(2\mathbf {k} _{2}+2\mathbf {k} _{3}+\mathbf {k} _{4}),\quad } cite-ref-3-4-3[4]cite-ref-1-6-3[6] ( 4.8 ) {\displaystyle \qquad \qquad (4.8)}

where

u j = L ( P p , q ( 2 − κ j M n c j h n ) ) 2 κ j r {\displaystyle \mathbf {u} _{j}=\mathbf {L} (\mathbf {P} _{p,q}(2^{-\kappa _{j}}\mathbf {M} _{n}c_{j}h_{n}))^{2^{\kappa _{j}}}\mathbf {r} }

and

k j = f ( t n + c j h n , y n + u j + c j h n k j − 1 ) − f ( t n , y n ) − f x ( t n , y n ) u j − f t ( t n , y n ) c j h n , {\displaystyle \mathbf {k} _{j}=\mathbf {f} \left(t_{n}+c_{j}h_{n},\mathbf {y} _{n}+\mathbf {u} _{j}+c_{j}h_{n}\mathbf {k} _{j-1}\right)-\mathbf {f} \left(t_{n},\mathbf {y} _{n}\right)-\mathbf {f} _{\mathbf {x} }\left(t_{n},\mathbf {y} _{n}\right)\mathbf {u} _{j}\ -\mathbf {f} _{t}\left(t_{n},\mathbf {y} _{n}\right)c_{j}h_{n},}

with k 1 ≡ 0 , c = [ 0 1 2 1 2 1 ] , {\displaystyle \mathbf {k} _{1}\equiv \mathbf {0} ,c=\left[{\begin{array}{cccc}0&{\frac {1}{2}}&{\frac {1}{2}}&1\end{array}}\right],} and p + q > 3. For large systems of ODEs, the vector u j {\displaystyle \mathbf {u} _{j}} in the above scheme is replaced by u j = L k m j , k j p , q ( c j h n , M n , r ) {\displaystyle \mathbf {u} _{j}=\mathbf {L\mathbf {k} } _{m_{j},k_{j}}^{p,q}(c_{j}h_{n},\mathbf {M} _{n},\mathbf {r} )} with m j > 4. {\displaystyle m_{j}>4.}

y n + 1 = y n + u s + h n ∑ j = 1 s b j k j and y ^ n + 1 = y n + u s + h n ∑ j = 1 s b ^ j k j , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {u} _{s}+h_{n}\sum _{j=1}^{s}b_{j}\mathbf {k} _{j}\qquad {\text{ and }}\qquad {\widehat {\mathbf {y} }}_{n+1}=\mathbf {y} _{n}+\mathbf {u} _{s}+h_{n}\sum _{j=1}^{s}{\widehat {b}}_{j}\mathbf {k} _{j},\quad } cite-ref-15-14-0[14]cite-ref-16-15-0[15] ( 4.9 ) {\displaystyle \qquad \qquad (4.9)}

where s = 7 is the number of stages,

k j = f ( t n + c j h n , y n + u j + h n ∑ i = 1 s − 1 a j , i k i ) − f ( t n , y n ) − f x ( t n , y n ) u j − f t ( t n , y n ) c j h n , {\displaystyle \mathbf {k} _{j}=\mathbf {f(} t_{n}+c_{j}h_{n},\mathbf {y} _{n}+\mathbf {u} _{j}+h_{n}\sum _{i=1}^{s-1}a_{j,i}\mathbf {k} _{i})-\mathbf {f} \left(t_{n},\mathbf {y} _{n}\right)-\mathbf {f} _{\mathbf {x} }\left(t_{n},\mathbf {y} _{n}\right)\mathbf {u} _{j}\ -\mathbf {f} _{t}\left(t_{n},\mathbf {y} _{n}\right)c_{j}h_{n},}

with k 1 ≡ 0 {\displaystyle \mathbf {k} _{1}\equiv \mathbf {0} } , and a j , i , b j , b ^ j a n d c j {\displaystyle a_{j,i},b_{j},{\widehat {b}}_{j}\quad and\quad c_{j}} are the Runge–Kutta coefficients of Dormand and Prince and p + q > 4. The vector u j {\displaystyle \mathbf {u} _{j}} in the above scheme is computed by a Padé or Krylor–Padé approximation for small or large systems of ODE, respectively.

By construction, the LL and HOLL discretizations inherit the stability and dynamics of the linear ODEs, but it is not the case of the LL schemes in general. With p ≤ q ≤ p + 2 {\displaystyle p\leq q\leq p+2} , the LL schemes (4.6)-(4.9) are A-stable.cite-ref-3-4-4[4] With q = p + 1 or q = p + 2, the LL schemes (4.6)–(4.9) are also L-stable.cite-ref-3-4-5[4] For linear ODEs, the LL schemes (4.6)-(4.9) converge with order p + q.cite-ref-3-4-6[4]cite-ref-25-9-3[9] In addition, with p = q = 6 and m n {\displaystyle m_{n}} = d, all the above described LL schemes yield to the ″exact computation″ (up to the precision of the floating-point arithmetic) of linear ODEs on the current personal computers.cite-ref-3-4-7[4]cite-ref-25-9-4[9] This includes stiff and highly oscillatory linear equations. Moreover, the LL schemes (4.6)-(4.9) are regular for linear ODEs and inherit the symplectic structure of Hamiltonian harmonic oscillators.cite-ref-2-5-5[5]cite-ref-9-13-1[13] These LL schemes are also linearization preserving, and display a better reproduction of the stable and unstable manifolds around hyperbolic equilibrium points and periodic orbits that other numerical schemes with the same stepsize.cite-ref-2-5-6[5]cite-ref-9-13-2[13] For instance, Figure 1 shows the phase portrait of the ODEs

d x 1 d t = − 2 x 1 + x 2 + 1 − μ f ( x 1 , λ ) ( 4.10 ) d x 2 d t = x 1 − 2 x 2 + 1 − μ f ( x 2 , λ ) ( 4.11 ) {\displaystyle {\begin{aligned}&{\frac {dx_{1}}{dt}}=-2x_{1}+x_{2}+1-\mu f(x_{1},\lambda )\qquad \qquad (4.10)\\[6pt]&{\frac {dx_{2}}{dt}}=x_{1}-2x_{2}+1-\mu f(x_{2},\lambda )\qquad \qquad \quad (4.11)\end{aligned}}}

with f ( u , λ ) = u ( 1 + u + λ u 2 ) − 1 {\displaystyle f(u,\lambda )=u(1+u+\lambda u^{2})^{-1}} , μ = 15 {\displaystyle \mu =15} and λ = 57 {\displaystyle \lambda =57} , and its approximation by various schemes. This system has two stable stationary points and one unstable stationary point in the region 0 ≤ x 1 , x 2 ≤ 1 {\displaystyle 0\leq x_{1},x_{2}\leq 1} .

Consider the d-dimensional Delay Differential Equation (DDE)

d x ( t ) d t = f ( t , x ( t ) , x t ( − τ 1 ) , … , x t ( − τ m ) ) , t ∈ [ t 0 , T ] , ( 5.1 ) {\displaystyle {\frac {d\mathbf {x} (t)}{dt}}=\mathbf {f} (t,\mathbf {x} (t),\mathbf {x} _{t}(-\tau _{1}),\ldots ,\mathbf {x} _{t}(-\tau _{m})),\qquad t\in [t_{0},T],\qquad \qquad (5.1)}

with m constant delays τ i > 0 {\displaystyle \tau _{i}>0} and initial condition x t 0 ( s ) = φ ( s ) {\displaystyle \mathbf {x} _{t_{0}}(s)=\mathbf {\varphi } (s)} for all s ∈ [ − τ , 0 ] , {\displaystyle s\in [-\tau ,0],} where f is a differentiable function, x t : [ − τ , 0 ] ⟶ R d {\displaystyle \mathbf {x} _{t}:[-\tau ,0]\longrightarrow \mathbb {R} ^{d}} is the segment function defined as

x t ( s ) := x ( t + s ) , s ∈ [ − τ , 0 ] , {\displaystyle \mathbf {x} _{t}(s):=\mathbf {x} (t+s),{\text{ }}s\in [-\tau ,0],}

for all t ∈ [ t 0 , T ] , φ : [ − τ , 0 ] ⟶ R d {\displaystyle t\in [t_{0},T],\mathbf {\varphi } :[-\tau ,0]\longrightarrow \mathbb {R} ^{d}} is a given function, and τ = max { τ 1 , … , τ m } . {\displaystyle \tau =\max \left\{\tau _{1},\ldots ,\tau _{m}\right\}.}

For a time discretization ( t ) h {\displaystyle (t)_{h}} , the Local Linear discretization of the DDE (5.1) at each point t n + 1 ∈ ( t ) h {\displaystyle t_{n+1}\in (t)_{h}} is defined by the recursive expression cite-ref-13-11-1[11]

z n + 1 = z n + Φ ( t n , z n , h n ; z ~ t n 1 , … , z ~ t n m ) , ( 5.2 ) {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\Phi (t_{n},\mathbf {z} _{n},h_{n};{\widetilde {\mathbf {z} }}_{t_{n}}^{1},\ldots ,{\widetilde {\mathbf {z} }}_{t_{n}}^{m}),\qquad \qquad (5.2)}

where

Φ ( t n , z n , h n ; z ~ t n 1 , … , z ~ t n m ) = ∫ 0 h n e A n ( h n − u ) [ ∑ i = 1 m B n i ( z ~ t n i ( u − τ i ) − z ~ t n i ( − τ i ) ) + d n ] d u + ∫ 0 h n ∫ 0 u e A n ( h n − u ) c n d r d u {\displaystyle \Phi (t_{n},\mathbf {z} _{n},h_{n};{\widetilde {\mathbf {z} }}_{t_{n}}^{1},\ldots ,{\widetilde {\mathbf {z} }}_{t_{n}}^{m})=\int \limits _{0}^{h_{n}}e^{\mathbf {A} _{n}(h_{n}-u)}\left[\sum \limits _{i=1}^{m}\mathbf {B} _{n}^{i}({\widetilde {\mathbf {z} }}_{t_{n}}^{i}(u-\tau _{i})-{\widetilde {\mathbf {z} }}_{t_{n}}^{i}(-\tau _{i}))+\mathbf {d} _{n}\right]\,du+\int \limits _{0}^{h_{n}}\int \limits _{0}^{u}e^{\mathbf {A} _{n}(h_{n}-u)}\mathbf {c} _{n}\,dr\,du}

z ~ t n i : [ − τ i , 0 ] ⟶ R d {\displaystyle {\widetilde {\mathbf {z} }}_{t_{n}}^{i}:\left[-\tau _{i},0\right]\longrightarrow \mathbb {R} ^{d}} is the segment function defined as

z ~ t n i ( s ) := z ~ i ( t n + s ) , s ∈ [ − τ i , 0 ] , {\displaystyle {\widetilde {\mathbf {z} }}_{t_{n}}^{i}(s):={\widetilde {\mathbf {z} }}^{i}(t_{n}+s),{\text{ }}s\in [-\tau _{i},0],}

and z ~ i : [ t n − τ i , t n ] ⟶ R d {\displaystyle {\widetilde {\mathbf {z} }}^{i}:\left[t_{n}-\tau _{i},t_{n}\right]\longrightarrow \mathbb {R} ^{d}} is a suitable approximation to x ( t ) {\displaystyle \mathbf {x} (t)} for all t ∈ [ t n − τ i , t n ] {\displaystyle t\in \lbrack t_{n}-\tau _{i},t_{n}]} such that z ~ i ( t n ) = z n . {\displaystyle {\widetilde {\mathbf {z} }}^{i}(t_{n})=\mathbf {z} _{n}.} Here,

A n = f x ( t n , z n , z ~ t n 1 ( − τ 1 ) , … , z ~ t n m ( − τ d ) ) , B n i = f x t ( − τ i ) ( t n , z n , z ~ t n 1 ( − τ 1 ) , … , z ~ t n m ( − τ d ) ) {\displaystyle \mathbf {A} _{n}=\mathbf {f} _{x}(t_{n},\mathbf {z} _{n},{\widetilde {\mathbf {z} }}_{t_{n}}^{1}(-\tau _{1}),\ldots ,{\widetilde {\mathbf {z} }}_{t_{n}}^{m}(-\tau _{d})),{\text{ }}\mathbf {B} _{n}^{i}=\mathbf {f} _{x_{t}(-\tau _{i})}(t_{n},\mathbf {z} _{n},{\widetilde {\mathbf {z} }}_{t_{n}}^{1}(-\tau _{1}),\ldots ,{\widetilde {\mathbf {z} }}_{t_{n}}^{m}(-\tau _{d}))}

are constant matrices and

c n = f t ( t n , z n , z ~ t n 1 ( − τ 1 ) , … , z ~ t n m ( − τ d ) ) and d n = f ( t n , z n , z ~ t n 1 ( − τ 1 ) , … , z ~ t n m ( − τ d ) ) {\displaystyle \mathbf {c} _{n}=\mathbf {f} _{t}(t_{n},\mathbf {z} _{n},{\widetilde {\mathbf {z} }}_{t_{n}}^{1}(-\tau _{1}),\ldots ,{\widetilde {\mathbf {z} }}_{t_{n}}^{m}(-\tau _{d})){\text{ and }}\mathbf {d} _{n}=\mathbf {f(} t_{n},\mathbf {z} _{n},{\widetilde {\mathbf {z} }}_{t_{n}}^{1}(-\tau _{1}),\ldots ,{\widetilde {\mathbf {z} }}_{t_{n}}^{m}(-\tau _{d}))}

are constant vectors. f t , f x a n d f x t ( − τ i ) {\displaystyle \mathbf {f} _{t},\mathbf {f} _{x}\quad and\quad \mathbf {f} _{x_{t}(-\tau _{i})}} denote, respectively, the partial derivatives of f with respect to the variables t and x, and x t ( − τ i ) {\displaystyle \mathbf {x} _{t}(-\tau _{i})} . The Local Linear discretization (5.2) converges to the solution of (5.1) with order α = min { 2 , r } , {\displaystyle \alpha =\min\{2,r\},} if z ~ t n i {\displaystyle {\widetilde {\mathbf {z} }}_{t_{n}}^{i}} approximates z t n i {\displaystyle \mathbf {z} _{t_{n}}^{i}} with order r ( i . e . , | z t n i ( u − τ i ) − z ~ t n i ( u − τ i ) | ∝ h n r {\displaystyle r\quad (i.e.,\left\vert \mathbf {z} _{t_{n}}^{i}\mathbf {(} u-\tau _{i}\mathbf {)} -{\widetilde {\mathbf {z} }}_{t_{n}}^{i}\mathbf {(} u-\tau _{i}\mathbf {)} \right\vert \propto h_{n}^{r}} for all u ∈ [ 0 , h n ] ) {\displaystyle u\in \lbrack 0,h_{n}])} .

Depending on the approximations z ~ t n i {\displaystyle {\widetilde {\mathbf {z} }}_{t_{n}}^{i}} and on the algorithm to compute ϕ {\displaystyle \mathbf {\phi } } different Local Linearizations schemes can be defined. Every numerical implementation y n {\displaystyle \mathbf {y} _{n}} of a Local Linear discretization z n {\displaystyle \mathbf {z} _{n}} is generically called local linearization scheme.

y n + 1 = y n + L ( P p , q ( 2 − k n M n h n ) ) 2 k n r , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r,} \quad } cite-ref-13-11-2[11] ( 5.3 ) {\displaystyle \qquad (5.3)}

where the matrices M n , L {\displaystyle \mathbf {M} _{n},\mathbf {L} } and r {\displaystyle \mathbf {r} } are defined as

M n = [ A n c n + ∑ i = 1 m B n i α n i d n 0 0 1 0 0 0 ] ∈ R ( d + 2 ) × ( d + 2 ) , {\displaystyle \mathbf {M} _{n}={\begin{bmatrix}\mathbf {A} _{n}&\mathbf {c} _{n}+\sum \limits _{i=1}^{m}\mathbf {B} _{n}^{i}\mathbf {\alpha } _{n}^{i}&\mathbf {d} _{n}\\0&0&1\\0&0&0\end{bmatrix}}\in \mathbb {R} ^{(d+2)\times (d+2)},}

L = [ I 0 d × 2 ] {\displaystyle \mathbf {L} =\left[{\begin{array}{ll}\mathbf {I} &\mathbf {0} _{d\times 2}\end{array}}\right]} and r ⊺ = [ 0 1 × ( d + 1 ) 1 ] , h n ≤ τ {\displaystyle \mathbf {r} ^{\intercal }=\left[{\begin{array}{ll}\mathbf {0} _{1\times (d+1)}&1\end{array}}\right],h_{n}\leq \tau } , and p + q > 1 {\displaystyle p+q>1} . Here, the matrices A n {\displaystyle \mathbf {A} _{n}} , B n i {\displaystyle \mathbf {B} _{n}^{i}} , c n {\displaystyle \mathbf {c} _{n}} and d n {\displaystyle \mathbf {d} _{n}} are defined as in (5.2), but replacing z {\displaystyle \mathbf {z} } by y {\displaystyle \mathbf {y} } and α n i = ( y ( t n + 1 − τ i ) − y ( t n − τ i ) ) / h n , {\displaystyle \mathbf {\alpha } _{n}^{i}=(\mathbf {y} (t_{n+1}-\tau _{i})-\mathbf {y} (t_{n}-\tau _{i}))/h_{n},} where

y ( t ) = y n t + L ( P p , q ( 2 − k n M n t ( t − t n t ) ) ) 2 k n r , {\displaystyle \mathbf {y} \left(t\right)=\mathbf {y} _{n_{t}}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n_{t}}(t-t_{n_{t}})))^{2^{k_{n}}}\mathbf {r} ,}

with n t = max { n = 0 , 1 , 2 , . . . , : t n ≤ t and t n ∈ ( t ) h } {\displaystyle n_{t}=\max\{n=0,1,2,...,:t_{n}\leq t{\text{ and }}t_{n}\in \left(t\right)_{h}\}} , is the Local Linear Approximation to the solution of (5.1) defined through the LL scheme (5.3) for all t ∈ [ t 0 , t n ] {\displaystyle t\in \lbrack t_{0},t_{n}]} and by y ( t ) = φ ( t ) {\displaystyle \mathbf {y} \left(t\right)=\mathbf {\varphi } \left(t\right)} for t ∈ [ t 0 − τ , t 0 ] {\displaystyle t\in \left[t_{0}-\tau ,t_{0}\right]} . For large systems of DDEs

y n + 1 = y n + L k m n , k n p , q ( h n , M n , r ) a n d y ( t ) = y n t + L k m n t , k n t p , q ( t − t n t , M n t , r ) , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {M} _{n},\mathbf {r} )\quad and\quad \mathbf {y} \left(t\right)=\mathbf {y} _{n_{t}}+\mathbf {L\mathbf {k} } _{m_{n_{t}},k_{n_{t}}}^{p,q}(t-t_{n_{t}},\mathbf {M} _{n_{t}},\mathbf {r} ),}

with p + q > 1 {\displaystyle p+q>1} and m n > 2 {\displaystyle m_{n}>2} . Fig. 2 Illustrates the stability of the LL scheme (5.3) and of that of an explicit scheme of similar order in the integration of a stiff system of DDEs.

Consider the d-dimensional Random Differential Equation (RDE)

d

x

(

t

)

d

t

=

f

(

x

(

t

)

,

ξ

(

t

)

)

,

t

∈

[

t

0

,

T

]

,

(

6.1

)

{\displaystyle {\frac {d\mathbf {x} \left(t\right)}{dt}}=\mathbf {f} (\mathbf {x} (t),\mathbf {\xi } (t)),\quad t\in \left[t_{0},T\right],\qquad \qquad \qquad (6.1)}

with initial condition x ( t 0 ) = x 0 , {\displaystyle \mathbf {x} (t_{0})=\mathbf {x} _{0},} where ξ {\displaystyle \mathbf {\xi } } is a k-dimensional separable finite continuous stochastic process, and f is a differentiable function. Suppose that a realization (path) of ξ {\displaystyle \mathbf {\xi } } is given.

For a time discretization ( t ) h {\displaystyle \left(t\right)_{h}} , the Local Linear discretization of the RDE (6.1) at each point t n + 1 ∈ ( t ) h {\displaystyle t_{n+1}\in \left(t\right)_{h}} is defined by the recursive expression cite-ref-24-16-0[16]

z n + 1 = z n + ϕ ( t n , z n ; h n ) , with z 0 = x 0 , {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } (t_{n},\mathbf {z} _{n};h_{n}),\qquad {\text{ with }}\qquad \mathbf {z} _{0}=\mathbf {x} _{0},}

where

ϕ ( t n , z n ; h n ) = ∫ 0 h n e f x ( z n , ξ ( t n ) ) ( h n − u ) ( f ( z n , ξ ( t n ) ) + f ξ ( z n , ξ ( t n ) ) ( ξ ~ ( t n + u ) − ξ ~ ( t n ) ) ) d u {\displaystyle \mathbf {\phi } (t_{n},\mathbf {z} _{n};h_{n})=\int \limits _{0}^{h_{n}}e^{\mathbf {f} _{\mathbf {x} }(\mathbf {z} _{n},\mathbf {\xi } (t_{n}))(h_{n}-u)}(\mathbf {f(z} _{n},\mathbf {\xi } (t_{n}))+\mathbf {f} _{\mathbf {\xi } }(\mathbf {z} _{n},\mathbf {\xi } (t_{n}))({\widetilde {\mathbf {\xi } }}(t_{n}+u)-{\widetilde {\mathbf {\xi } }}(t_{n})))\,du}

and ξ ~ {\displaystyle {\widetilde {\mathbf {\xi } }}} is an approximation to the process ξ {\displaystyle \mathbf {\xi } } for all t ∈ [ t 0 , T ] . {\displaystyle t\in \left[t_{0},T\right].} Here, f x {\displaystyle \mathbf {f} _{x}} and f ξ {\displaystyle \mathbf {f} _{\xi }} denote the partial derivatives of f {\displaystyle \mathbf {f} } with respect to x {\displaystyle \mathbf {x} } and ξ {\displaystyle \xi } , respectively.

Depending on the approximations ξ ~ {\displaystyle {\widetilde {\mathbf {\xi } }}} to the process ξ {\displaystyle \mathbf {\xi } } and of the algorithm to compute ϕ {\displaystyle \mathbf {\phi } } , different Local Linearizations schemes can be defined. Every numerical implementation y n {\displaystyle \mathbf {y} _{n}} of the local linear discretization z n {\displaystyle \mathbf {z} _{n}} is generically called local linearization scheme.

y

n

+

1

=

y

n

+

L

(

P

p

,

q

(

2

−

k

n

M

n

h

n

)

)

2

k

n

r

,

{\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r,} \quad }

where the matrices M n , L a n d r {\displaystyle \mathbf {M} _{n},\quad \mathbf {L} \quad and\quad \mathbf {r} } are defined as

M n = [ f x ( y n , ξ ( t n ) ) f ξ ( y n , ξ ( t n ) ( ξ ( t n + 1 ) − ξ ( t n ) ) / h n f ( y n , ξ ( t n ) ) 0 0 1 0 0 0 ] {\displaystyle \mathbf {M} _{n}=\left[{\begin{array}{ccc}\mathbf {f} _{\mathbf {x} }\left(\mathbf {y} _{n},\mathbf {\xi } (t_{n})\right)&\mathbf {f} _{\mathbf {\xi } }(\mathbf {y} _{n},\mathbf {\xi } (t_{n})(\mathbf {\xi } (t_{n+1})-\mathbf {\xi } (t_{n}))/h_{n}&\mathbf {f} \left(\mathbf {y} _{n},\mathbf {\xi } (t_{n})\right)\\0&0&1\\0&0&0\end{array}}\right]}

L = [ I 0 d × 2 ] {\displaystyle \mathbf {L} =\left[{\begin{array}{ll}\mathbf {I} &\mathbf {0} _{d\times 2}\end{array}}\right]} , r ⊺ = [ 0 1 × ( d + 1 ) 1 ] {\displaystyle \mathbf {r} ^{\intercal }=\left[{\begin{array}{ll}\mathbf {0} _{1\times (d+1)}&1\end{array}}\right]} , and p+q>1. For large systems of RDEs,cite-ref-10-17-1[17]

y n + 1 = y n + L k m n , k n p , q ( h n , M n , r ) , p + q > 1 a n d m n > 2. {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {M} _{n},\mathbf {r} ),\quad p+q>1\quad and\quad m_{n}>2.}

The convergence rate of both schemes is m i n { 2 , 2 γ } {\displaystyle min\{2,2\gamma \}} , where is γ {\displaystyle \gamma } the exponent of the Holder condition of ξ {\displaystyle \mathbf {\xi } } .

Figure 3 presents the phase portrait of the RDE

d x 1 d t = − x 2 + ( 1 − x 1 2 − x 2 2 ) x 1 sin ⁡ ( w H ( t ) ) 2 , x 1 ( 0 ) = 0.8 ( 6.2 ) {\displaystyle {\frac {dx_{1}}{dt}}=-x_{2}+\left(1-x_{1}^{2}-x_{2}^{2}\right)x_{1}\sin(w^{H}(t))^{2},\quad \qquad x_{1}(0)=0.8\qquad (6.2)}

d x 2 d t = x 1 + ( 1 − x 1 2 − x 2 2 ) x 2 sin ⁡ ( w H ( t ) ) 2 , x 2 ( 0 ) = 0.1 , ( 6.3 ) {\displaystyle {\frac {dx_{2}}{dt}}=x_{1}+(1-x_{1}^{2}-x_{2}^{2})x_{2}\sin(w^{H}(t))^{2},\qquad \qquad x_{2}(0)=0.1,\qquad (6.3)}

and its approximation by two numerical schemes, where w H {\displaystyle w^{H}} denotes a fractional Brownian process with Hurst exponent H=0.45.

Consider the d-dimensional Stochastic Differential Equation (SDE)

d x ( t ) = f ( t , x ( t ) ) d t + ∑ i = 1 m g i ( t ) d w i ( t ) , t ∈ [ t 0 , T ] , ( 7.1 ) {\displaystyle d\mathbf {x} (t)=\mathbf {f} (t,\mathbf {x} (t))dt+\sum \limits _{i=1}^{m}\mathbf {g} _{i}(t)d\mathbf {w} ^{i}(t),\quad t\in \left[t_{0},T\right],\qquad \qquad \qquad (7.1)}

with initial condition x ( t 0 ) = x 0 {\displaystyle \mathbf {x} (t_{0})=\mathbf {x} _{0}} , where the drift coefficient f {\displaystyle \mathbf {f} } and the diffusion coefficient g i {\displaystyle \mathbf {g} _{i}} are differentiable functions, and w = ( w 1 , … , w m ) {\displaystyle \mathbf {w=(\mathbf {w} } ^{1},\ldots ,\mathbf {w} ^{m}\mathbf {)} } is an m-dimensional standard Wiener process.

For a time discretization ( t ) h {\displaystyle \left(t\right)_{h}} , the order- γ {\displaystyle \mathbb {\gamma } } (=1,1.5) Strong Local Linear discretization of the solution of the SDE (7.1) is defined by the recursive relation cite-ref-14-18-0[18]cite-ref-20-19-0[19]

z n + 1 = z n + ϕ γ ( t n , z n ; h n ) + ξ ( t n , z n ; h n ) , w i t h z 0 = x 0 , {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } _{\mathbb {\gamma } }(t_{n},\mathbf {z} _{n};h_{n})+\mathbf {\xi } (t_{n},\mathbf {z} _{n};h_{n}),\quad with\quad \mathbf {z} _{0}=\mathbf {x} _{0},}

where

ϕ γ ( t n , z n ; δ ) = ∫ 0 δ e f x ( t n , y n ) ( δ − u ) ( f ( t n , z n ) + a γ ( t n , z n ) u ) d u {\displaystyle \mathbf {\phi } _{\mathbb {\gamma } }(t_{n},\mathbf {z} _{n};\delta )=\int _{0}^{\delta }e^{\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n})(\delta -u)}(\mathbf {f(} t_{n},\mathbf {z} _{n})+\mathbf {a} ^{\mathbb {\gamma } }(t_{n},\mathbf {z} _{n})u)du}

and

ξ ( t n , z n ; δ ) = ∑ i = 1 m ∫ t n t n + δ e f x ( t n , z n ) ( t n + δ − u ) g i ( u ) d w i ( u ) . {\displaystyle \mathbf {\xi } \left(t_{n},\mathbf {z} _{n};\delta \right)=\sum \limits _{i=1}^{m}\int \nolimits _{t_{n}}^{t_{n}+\delta }e^{\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})(t_{n}+\delta -u)}\mathbf {g} _{i}(u)\,d\mathbf {w} ^{i}(u).}

Here,

a γ ( t n , z n ) = { f t ( t n , z n ) for γ = 1 f t ( t n , z n ) + 1 2 ∑ j = 1 m ( I ⊗ g j ⊺ ( t n ) ) f x x ( t n , z n ) g j ( t n ) for γ = 1.5 , {\displaystyle \mathbf {a} ^{\mathbb {\gamma } }(t_{n},\mathbf {z} _{n})=\left\{{\begin{array}{cl}\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})&{\text{for }}\qquad \mathbb {\gamma } =1\\\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})+{\frac {1}{2}}\sum \limits _{j=1}^{m}(\mathbf {I} \otimes \mathbf {g} _{j}^{\intercal }(t_{n}))\mathbf {f} _{\mathbf {xx} }(t_{n},\mathbf {z} _{n})\mathbf {g} _{j}(t_{n})&{\text{for }}\quad \mathbb {\gamma } =1.5,\end{array}}\right.}

f x , f t {\displaystyle \mathbf {f} _{\mathbf {x} },\mathbf {f} _{t}} denote the partial derivatives of f {\displaystyle \mathbf {f} } with respect to the variables x {\displaystyle \mathbf {x} } and t, respectively, and f x x {\displaystyle \mathbf {f} _{\mathbf {xx} }} the Hessian matrix of f {\displaystyle \mathbf {f} } with respect to x {\displaystyle \mathbf {x} } . The strong Local Linear discretization z n + 1 {\displaystyle \mathbf {z} _{n+1}} converges with order γ {\displaystyle \mathbb {\gamma } } (= 1, 1.5) to the solution of (7.1).

After the local linearization of the drift term of (7.1) at ( t n , z n ) {\displaystyle (t_{n},\mathbf {z} _{n})} , the equation for the residual r {\displaystyle \mathbf {r} } is given by

d r ( t ) = q γ ( t n , z n ; t , r ( t ) ) d t + ∑ i = 1 m g i ( t ) d w i ( t ) , r ( t n ) = 0 {\displaystyle d\mathbf {r} (t)=\mathbf {q} _{\gamma }(t_{n},\mathbf {z} _{n};t\mathbf {,\mathbf {r} } (t))\,dt+\sum \limits _{i=1}^{m}\mathbf {g} _{i}(t)\,d\mathbf {w} ^{i}(t)\mathbf {,} \qquad \mathbf {r} (t_{n})=\mathbf {0} }

for all t ∈ [ t n , t n + 1 ] {\displaystyle t\in \lbrack t_{n},t_{n+1}]} , where

q γ ( t n , z n ; s , ξ ) = f ( s , z n + ϕ γ ( t n , z n ; s − t n ) + ξ ) − f x ( t n , z n ) ϕ γ ( t n , z n ; s − t n ) − a γ ( t n , z n ) ( s − t n ) − f ( t n , z n ) . {\displaystyle \mathbf {q} _{\gamma }(t_{n},\mathbf {z} _{n};s\mathbf {,\xi } )=\mathbf {f} (s,\mathbf {z} _{n}+\mathbf {\phi } _{\gamma }(t_{n},\mathbf {z} _{n};s-t_{n})+\mathbf {\xi } )-\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})\mathbf {\phi } _{\gamma }(t_{n},\mathbf {z} _{n};s-t_{n})-\mathbf {a} ^{\gamma }(t_{n},\mathbf {z} _{n})(s-t_{n})-\mathbf {f} (t_{n},\mathbf {z} _{n}).}

A high-order local linear discretization of the SDE (7.1) at each point t n + 1 ∈ ( t ) h {\displaystyle t_{n+1}\in (t)_{h}} is then defined by the recursive expression cite-ref-4-20-0[20]

z n + 1 = z n + ϕ γ ( t n , z n ; h n ) + r ~ ( t n , z n ; h n ) , with z 0 = x 0 , {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } _{\gamma }(t_{n},\mathbf {z} _{n};h_{n})+{\widetilde {\mathbf {r} }}(t_{n},\mathbf {z} _{n};h_{n}),\qquad {\text{ with }}\qquad \mathbf {z} _{0}=\mathbf {x} _{0},}

where r ~ {\displaystyle {\widetilde {\mathbf {r} }}} is a strong approximation to the residual r {\displaystyle \mathbf {r} } of order α {\displaystyle \alpha } higher than 1.5. The strong HOLL discretization z n + 1 {\displaystyle \mathbf {z} _{n+1}} converges with order α {\displaystyle \alpha } to the solution of (7.1).

Depending on the way of computing ϕ γ {\displaystyle \mathbf {\phi } _{\mathbb {\gamma } }} , ξ {\displaystyle \mathbf {\xi } } and r ~ {\displaystyle {\widetilde {\mathbf {r} }}} different numerical schemes can be obtained. Every numerical implementation y n {\displaystyle \mathbf {y} _{n}} of a strong Local Linear discretization z n {\displaystyle \mathbf {z} _{n}} of any order is generically called Strong Local Linearization (SLL) scheme.

y n + 1 = y n + L ( P p , q ( 2 − k n M n h n ) ) 2 k n r + ∑ i = 1 m g i ( t n ) Δ w n i , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r+} \sum \limits _{i=1}^{m}\mathbf {g} _{i}(t_{n})\Delta \mathbf {w} _{n}^{i},\quad } cite-ref-23-21-0[21] ( 7.2 ) {\displaystyle \qquad \qquad (7.2)}

where the matrices M n {\displaystyle \mathbf {M} _{n}} , L {\displaystyle \mathbf {L} } and r {\displaystyle \mathbf {r} } are defined as in (4.6), Δ w n i {\displaystyle \Delta \mathbf {w} _{n}^{i}} is an i.i.d. zero mean Gaussian random variable with variance h n {\displaystyle h_{n}} , and p + q > 1. For large systems of SDEs,cite-ref-23-21-1[21] in the above scheme ( P p , q ( 2 − k n M n h n ) ) 2 k n r {\displaystyle (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r} } is replaced by k m n , k n p , q ( h n , M n , r ) {\displaystyle \mathbf {\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {M} _{n},\mathbf {r} )} .

y n + 1 = y n + L ( P p , q ( 2 − k n M n h n ) ) 2 k n r + ∑ i = 1 m ( g i ( t n ) Δ w n i f x ( t n , y ~ n ) g i ( t n ) Δ z n i + d g i ( t n ) d t ( Δ w n i h n − Δ z n i ) ) , ( 7.3 ) {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r} +\sum \limits _{i=1}^{m}\left(\mathbf {g} _{i}(t_{n})\Delta \mathbf {w} _{n}^{i}\mathbf {f} _{\mathbf {x} }(t_{n},{\widetilde {\mathbf {y} }}_{n})\mathbf {g} _{i}(t_{n})\Delta \mathbf {z} _{n}^{i}+{\frac {d\mathbf {g} _{i}(t_{n})}{dt}}(\Delta \mathbf {w} _{n}^{i}h_{n}-\Delta \mathbf {z} _{n}^{i})\right),\qquad \qquad (7.3)}

where the matrices M n {\displaystyle \mathbf {M} _{n}} , L {\displaystyle \mathbf {L} } and r {\displaystyle \mathbf {r} } are defined as

M n = [ f x ( t n , y n ) f t ( t n , y n ) + 1 2 ∑ j = 1 m ( I ⊗ g j ⊺ ( t n ) ) f x x ( t n , y n ) g j ( t n ) f ( t n , y n ) 0 0 1 0 0 0 ] ∈ R ( d + 2 ) × ( d + 2 ) , {\displaystyle \mathbf {M} _{n}={\begin{bmatrix}\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n})&\mathbf {f} _{t}(t_{n},\mathbf {y} _{n})+{\frac {1}{2}}\sum \limits _{j=1}^{m}\left(\mathbf {I} \otimes \mathbf {g} _{j}^{\intercal }(t_{n})\right)\mathbf {f} _{\mathbf {xx} }(t_{n},\mathbf {y} _{n})\mathbf {g} _{j}(t_{n})&\mathbf {f} (t_{n},\mathbf {y} _{n})\\0&0&1\\0&0&0\end{bmatrix}}\in \mathbb {R} ^{(d+2)\times (d+2)},}

L = [ I 0 d × 2 ] , r ⊺ = [ 0 1 × ( d + 1 ) 1 ] {\displaystyle \mathbf {L} =\left[{\begin{array}{ll}\mathbf {I} &\mathbf {0} _{d\times 2}\end{array}}\right],\mathbf {r} ^{\intercal }=\left[{\begin{array}{ll}\mathbf {0} _{1\times (d+1)}&1\end{array}}\right]} , Δ z n i {\displaystyle \Delta \mathbf {z} _{n}^{i}} is a i.i.d. zero mean Gaussian random variable with variance E ( ( Δ z n i ) 2 ) = 1 3 h n 3 {\displaystyle E\left((\Delta \mathbf {z} _{n}^{i})^{2}\right)={\frac {1}{3}}h_{n}^{3}} and covariance E ( Δ w n i Δ z n i ) = 1 2 h n 2 {\displaystyle E(\Delta \mathbf {w} _{n}^{i}\Delta \mathbf {z} _{n}^{i})={\frac {1}{2}}h_{n}^{2}} and p+q>1 cite-ref-12-12-2[12]. For large systems of SDEs,cite-ref-12-12-3[12] in the above scheme ( P p , q ( 2 − k n M n h n ) ) 2 k n r {\displaystyle (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r} } is replaced by k m n , k n p , q ( h n , M n , r ) {\displaystyle \mathbf {\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {M} _{n},\mathbf {r} )} .

y t n + 1 = y n + L ( P p , q ( 2 − k n M n h n ) ) 2 k n r + ∑ j = 1 m g j ( t n ) Δ w n j + ∑ j = 1 m f x ( t n , y n ) g j ( t n ) J ~ ( j , 0 ) + ∑ j = 1 m d g j d t ( t n ) J ~ ( 0 , j ) {\displaystyle \mathbf {y} _{t_{n+1}}=\mathbf {y} _{n}+\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r} +\sum \limits _{j=1}^{m}\mathbf {g} _{j}\left(t_{n}\right)\Delta \mathbf {w} _{n}^{j}+\sum \limits _{j=1}^{m}\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n})\mathbf {g} _{j}\left(t_{n}\right){\widetilde {J}}_{\left(j,0\right)}+\sum \limits _{j=1}^{m}{\frac {d\mathbf {g} _{_{j}}}{dt}}\left(t_{n}\right){\widetilde {J}}_{\left(0,j\right)}}

+ ∑ j 1 , j 2 = 1 m ( I ⊗ g j 2 ⊺ ( t n ) ) f x x ( t n , y n ) g j 1 ( t n ) J ~ ( j 1 , j 2 , 0 ) , ( 7.4 ) {\displaystyle \qquad \qquad +\sum \limits _{j_{1},j_{2}=1}^{m}\left(\mathbf {I} \otimes \mathbf {g} _{j_{2}}^{\intercal }\left(t_{n}\right)\right)\mathbf {f} _{\mathbf {xx} }(t_{n},\mathbf {y} _{n})\mathbf {g} _{j_{1}}\left(t_{n}\right){\widetilde {J}}_{\left(j_{1},j_{2},0\right),}\qquad \qquad (7.4)}

where M n {\displaystyle \mathbf {M} _{n}} , L {\displaystyle \mathbf {L} } , r {\displaystyle \mathbf {r} } and Δ w n i {\displaystyle \Delta \mathbf {w} _{n}^{i}} are defined as in the order-1 SLL schemes, and J ~ α {\displaystyle {\widetilde {J}}_{\alpha }} is order 2 approximation to the multiple Stratonovish integral J α {\displaystyle J_{\alpha }} .cite-ref-4-20-1[20]

For SDEs with a single Wiener noise (m=1) cite-ref-4-20-2[20]

y t n + 1 = y n + ϕ ~ ( t n , y n ; h n ) + h n 2 ( k 1 + k 2 ) + g ( t n ) Δ w n + ( g ( t n + 1 ) − g ( t n ) ) h n J ( 0 , 1 ) ( 7.5 ) {\displaystyle \mathbf {y} _{t_{n+1}}=\mathbf {y} _{n}+{\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};h_{n})+{\frac {h_{n}}{2}}\left(\mathbf {k} _{1}+\mathbf {k} _{2}\right)+\mathbf {g} \left(t_{n}\right)\Delta w_{n}+{\frac {\left(\mathbf {g} \left(t_{n+1}\right)-\mathbf {g} \left(t_{n}\right)\right)}{h_{n}}}J_{\left(0,1\right)}\quad (7.5)}

{\displaystyle \quad \quad \quad }

where

k 1 = f ( t n + h n 2 , y n + ϕ ~ ( t n , y n ; h n 2 ) + γ + ) − f x ( t n , y n ) ϕ ~ ( t n , y n ; h n 2 ) − f ( t n , y n ) − f t ( t n , y n ) h n 2 , {\displaystyle \mathbf {k} _{1}=\mathbf {f} (t_{n}+{\frac {h_{n}}{2}},\mathbf {y} _{n}+{\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};{\frac {h_{n}}{2}})+\gamma _{+})-\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n}){\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};{\frac {h_{n}}{2}})-\mathbf {f} \left(t_{n},\mathbf {y} _{n}\right)-\mathbf {f} _{t}\left(t_{n},\mathbf {y} _{n}\right){\frac {h_{n}}{2}},}

k 2 = f ( t n + h n 2 , y n + ϕ ~ ( t n , y n ; h n 2 ) + γ − ) − f x ( t n , y n ) ϕ ~ ( t n , y n ; h n 2 ) − f ( t n , y n ) − f t ( t n , y n ) h n 2 , {\displaystyle \mathbf {k} _{2}=\mathbf {f} (t_{n}+{\frac {h_{n}}{2}},\mathbf {y} _{n}+{\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};{\frac {h_{n}}{2}})+\gamma _{-})-\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n}){\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};{\frac {h_{n}}{2}})-\mathbf {f} \left(t_{n},\mathbf {y} _{n}\right)-\mathbf {f} _{t}\left(t_{n},\mathbf {y} _{n}\right){\frac {h_{n}}{2}},}

with γ ± = 1 h n g ( t n ) ( J ~ ( 1 , 0 ) ± 2 J ~ ( 1 , 1 , 0 ) h n − J ~ ( 1 , 0 ) 2 ) {\displaystyle \gamma _{\pm }={\frac {1}{h_{n}}}\mathbf {g} \left(t_{n}\right){\Bigl (}{\widetilde {J}}_{\left(1,0\right)}\pm {\sqrt {2{\widetilde {J}}_{\left(1,1,0\right)}h_{n}-{\widetilde {J}}_{\left(1,0\right)}^{2}}}{\Bigr )}} .

Here, ϕ ~ ( t n , y n ; h n ) = L ( P p , q ( 2 − k n M n h n ) ) 2 k n r {\displaystyle {\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};h_{n})=\mathbf {L} (\mathbf {P} _{p,q}(2^{-k_{n}}\mathbf {M} _{n}h_{n}))^{2^{k_{n}}}\mathbf {r} } for low dimensional SDEs, and ϕ ~ ( t n , y n ; h n ) = L k m n , k n p , q ( h n , M n , r ) {\displaystyle {\widetilde {\mathbf {\phi } }}(t_{n},\mathbf {y} _{n};h_{n})=\mathbf {L\mathbf {k} } _{m_{n},k_{n}}^{p,q}(h_{n},\mathbf {M} _{n},\mathbf {r} )} for large systems of SDEs, where M n {\displaystyle \mathbf {M} _{n}} , L {\displaystyle \mathbf {L} } , r {\displaystyle \mathbf {r} } , Δ w n i {\displaystyle \Delta \mathbf {w} _{n}^{i}} and J ~ α {\displaystyle {\widetilde {J}}_{\alpha }} are defined as in the order-2 SLL-Taylor schemes, p+q>1 and m n > 2 {\displaystyle m_{n}>2} .

By construction, the strong LL and HOLL discretizations inherit the stability and dynamics of the linear SDEs, but it is not the case of the strong LL schemes in general. LL schemes (7.2)-(7.5) with p ≤ q ≤ p + 2 {\displaystyle p\leq q\leq p+2} are A-stable, including stiff and highly oscillatory linear equations.cite-ref-12-12-4[12] Moreover, for linear SDEs with random attractors, these schemes also have a random attractor that converges in probability to the exact one as the stepsize decreases and preserve the ergodicity of these equations for any stepsize.cite-ref-4-20-3[20]cite-ref-12-12-5[12] These schemes also reproduce essential dynamical properties of simple and coupled harmonic oscillators such as the linear growth of energy along the paths, the oscillatory behavior around 0, the symplectic structure of Hamiltonian oscillators, and the mean of the paths.cite-ref-4-20-4[20]cite-ref-5-22-0[22] For nonlinear SDEs with small noise (i.e., (7.1) with g i ( t ) ≈ 0 {\displaystyle \mathbf {g} _{i}(t)\approx 0} ), the paths of these SLL schemes are basically the nonrandom paths of the LL scheme (4.6) for ODEs plus a small disturbance related to the small noise. In this situation, the dynamical properties of that deterministic scheme, such as the linearization preserving and the preservation of the exact solution dynamics around hyperbolic equilibrium points and periodic orbits, become relevant for the paths of the SLL scheme.cite-ref-4-20-5[20] For instance, Fig 4 shows the evolution of domains in the phase plane and the energy of the stochastic oscillator

d x ( t ) = y ( t ) d t , x 1 ( 0 ) = 0.01 d y ( t ) = − ( ω 2 x ( t ) + ϵ x 4 ( t ) ) d t + σ d w t , x 1 ( 0 ) = 0.1 , ( 7.6 ) {\displaystyle {\begin{array}{ll}dx(t)=y(t)dt,&x_{1}(0)=0.01\\dy(t)=-(\omega ^{2}x(t)+\epsilon x^{4}(t))dt+\sigma dw_{t},&x_{1}(0)=0.1,\end{array}}\qquad \qquad (7.6)}

and their approximations by two numerical schemes.

Consider the d-dimensional stochastic differential equation

d x ( t ) = f ( t , x ( t ) ) d t + ∑ i = 1 m g i ( t ) d w i ( t ) , t ∈ [ t 0 , T ] , ( 8.1 ) {\displaystyle d\mathbf {x} (t)=\mathbf {f} (t,\mathbf {x} (t))dt+\sum \limits _{i=1}^{m}\mathbf {g} _{i}(t)d\mathbf {w} ^{i}(t),\qquad t\in \left[t_{0},T\right],\qquad \qquad (8.1)}

with initial condition x ( t 0 ) = x 0 {\displaystyle \mathbf {x} (t_{0})=\mathbf {x} _{0}} , where the drift coefficient f {\displaystyle \mathbf {f} } and the diffusion coefficient g i {\displaystyle \mathbf {g} _{i}} are differentiable functions, and w = ( w 1 , … , w m ) {\displaystyle \mathbf {w=(\mathbf {w} } ^{1},\ldots ,\mathbf {w} ^{m}\mathbf {)} } is an m-dimensional standard Wiener process.

For a time discretization ( t ) h {\displaystyle \left(t\right)_{h}} , the order- β {\displaystyle \mathbb {\beta } } ( = 1 , 2 ) {\displaystyle (=1,2)} Weak Local Linear discretization of the solution of the SDE (8.1) is defined by the recursive relation cite-ref-21-23-0[23]

z n + 1 = z n + ϕ β ( t n , z n ; h n ) + η ( t n , z n ; h n ) , w i t h z 0 = x 0 , {\displaystyle \mathbf {z} _{n+1}=\mathbf {z} _{n}+\mathbf {\phi } _{\mathbb {\beta } }(t_{n},\mathbf {z} _{n};h_{n})+\mathbf {\eta } (t_{n},\mathbf {z} _{n};h_{n}),\quad with\quad \mathbf {z} _{0}=\mathbf {x} _{0},}

where

ϕ β ( t n , z n ; δ ) = ∫ 0 δ e f x ( t n , z n ) ( δ − u ) ( f ( t n , z n ) + b β ( t n , z n ) u ) d u {\displaystyle \mathbf {\phi } _{\mathbb {\beta } }(t_{n},\mathbf {z} _{n};\delta )=\int _{0}^{\delta }e^{\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})(\delta -u)}(\mathbf {f(} t_{n},\mathbf {z} _{n})+\mathbf {b} ^{\mathbb {\beta } }(t_{n},\mathbf {z} _{n})u)du}

with

b β ( t n , z n ) = { f t ( t n , z n ) for β = 1 f t ( t n , z n ) + 1 2 ∑ j = 1 m ( I ⊗ g j ⊺ ( t n ) ) f x x ( t n , z n ) g j ( t n ) for β = 2 , {\displaystyle \mathbf {b} ^{\mathbb {\beta } }(t_{n},\mathbf {z} _{n})={\begin{cases}\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})&{\text{for }}\mathbb {\beta } =1\\\mathbf {f} _{t}(t_{n},\mathbf {z} _{n})+{\frac {1}{2}}\sum \limits _{j=1}^{m}\left(\mathbf {I} \otimes \mathbf {g} _{j}^{\intercal }\left(t_{n}\right)\right)\mathbf {f} _{\mathbf {xx} }(t_{n},\mathbf {z} _{n})\mathbf {g} _{j}\left(t_{n}\right)&{\text{for }}\mathbb {\beta } =2,\end{cases}}}

and η ( t n , z n ; δ ) {\displaystyle \mathbf {\eta } (t_{n},\mathbf {z} _{n};\delta )} is a zero mean stochastic process with variance matrix

Σ ( t n , z n ; δ ) = ∫ 0 δ e f x ( t n , z n ) ( δ − s ) G ( t n + s ) G ⊺ ( t n + s ) e f x ⊺ ( t n , z n ) ( δ − s ) d s . {\displaystyle \mathbf {\Sigma } (t_{n},\mathbf {z} _{n};\delta )=\int \limits _{0}^{\delta }e^{\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {z} _{n})(\delta -s)}\mathbf {G} (t_{n}+s)\mathbf {G} ^{\intercal }(t_{n}+s)e^{\mathbf {f} _{\mathbf {x} }^{\intercal }(t_{n},\mathbf {z} _{n})(\delta -s)}ds.}

Here, f x {\displaystyle \mathbf {f} _{\mathbf {x} }} , f t {\displaystyle \mathbf {f} _{t}} denote the partial derivatives of f {\displaystyle \mathbf {f} } with respect to the variables x {\displaystyle \mathbf {x} } and t, respectively, f x x {\displaystyle \mathbf {f} _{\mathbf {xx} }} the Hessian matrix of f {\displaystyle \mathbf {f} } with respect to x {\displaystyle \mathbf {x} } , and G ( t ) = [ g 1 ( t ) , … , g m ( t ) ] {\displaystyle \mathbf {G} (t)=[\mathbf {g} _{1}(t),\ldots ,\mathbf {g} _{m}(t)]} . The weak Local Linear discretization z n + 1 {\displaystyle \mathbf {z} _{n+1}} converges with order β {\displaystyle \mathbb {\beta } } (=1,2) to the solution of (8.1).

Depending on the way of computing ϕ β {\displaystyle \mathbf {\phi } _{\mathbb {\beta } }} and Σ {\displaystyle \mathbf {\Sigma } } different numerical schemes can be obtained. Every numerical implementation y n {\displaystyle \mathbf {y} _{n}} of the Weak Local Linear discretization z n {\displaystyle \mathbf {z} _{n}} is generically called Weak Local Linearization (WLL) scheme.

y n + 1 = y n + B 14 + ( B 12 B 11 ⊺ ) 1 / 2 ξ n {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {B} _{14}+(\mathbf {B} _{12}\mathbf {B} _{11}^{\intercal })^{1/2}\mathbf {\xi } _{n}} cite-ref-11-24-0[24]cite-ref-0-25-0[25]

where, for SDEs with autonomous diffusion coefficients, B 11 {\displaystyle \mathbf {B} _{11}} , B 12 {\displaystyle \mathbf {B} _{12}} and B 14 {\displaystyle \mathbf {B} _{14}} are the submatrices defined by the partitioned matrix B = P p , q ( 2 − k n M n h n ) ) 2 k n {\displaystyle \mathbf {B} =\mathbf {P} _{p,q}(2^{-k_{n}}{\mathcal {M}}_{n}h_{n}))^{2^{k_{n}}}} , with

M n = [ f x ( t n , y n ) G G ⊺ f t ( t n , y n ) f ( t n , y n ) 0 − f x ⊺ ( t n , y n ) 0 0 0 0 0 1 0 0 0 0 ] ∈ R ( 2 d + 2 ) × ( 2 d + 2 ) , {\displaystyle {\mathcal {M}}_{n}=\left[{\begin{array}{cccc}\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n})&\mathbf {GG} ^{\intercal }&\mathbf {f} _{t}(t_{n},\mathbf {y} _{n})&\mathbf {f} (t_{n},\mathbf {y} _{n})\\\mathbf {0} &-\mathbf {f} _{\mathbf {x} }^{\intercal }(t_{n},\mathbf {y} _{n})&\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &0&1\\\mathbf {0} &\mathbf {0} &0&0\end{array}}\right]\in \mathbb {R} ^{(2d+2)\times (2d+2)},}

and { ξ n } {\displaystyle \{\mathbf {\xi } _{n}\}} is a sequence of d-dimensional independent two-points distributed random vectors satisfying P ( ξ n k = ± 1 ) = 1 2 {\displaystyle P(\xi _{n}^{k}=\pm 1)={\frac {1}{2}}} .

y n + 1 = y n + B 16 + ( B 14 B 11 ⊺ ) 1 / 2 ξ n , {\displaystyle \mathbf {y} _{n+1}=\mathbf {y} _{n}+\mathbf {B} _{16}+(\mathbf {B} _{14}\mathbf {B} _{11}^{\intercal })^{1/2}\mathbf {\xi } _{n},} cite-ref-11-24-1[24]cite-ref-0-25-1[25]

where B 11 {\displaystyle \mathbf {B} _{11}} , B 14 {\displaystyle \mathbf {B} _{14}} and B 16 {\displaystyle \mathbf {B} _{16}} are the submatrices defined by the partitioned matrix B = P p , q ( 2 − k n M n h n ) ) 2 k n {\displaystyle \mathbf {B} =\mathbf {P} _{p,q}(2^{-k_{n}}{\mathcal {M}}_{n}h_{n}))^{2^{k_{n}}}} with

M n = [ J H 2 H 1 H 0 a 2 a 1 0 − J ⊺ I 0 0 0 0 0 − J ⊺ I 0 0 0 0 0 − J ⊺ 0 0 0 0 0 0 0 1 0 0 0 0 0 0 ] ∈ R ( 4 d + 2 ) × ( 4 d + 2 ) , {\displaystyle {\mathcal {M}}_{n}=\left[{\begin{array}{cccccc}\mathbf {J} &\mathbf {H} _{2}&\mathbf {H} _{1}&\mathbf {H} _{0}&\mathbf {a} _{2}&\mathbf {a} _{1}\\\mathbf {0} &-\mathbf {J} ^{\intercal }&\mathbf {I} &\mathbf {0} &\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &-\mathbf {J} ^{\intercal }&\mathbf {I} &\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {0} &-\mathbf {J} ^{\intercal }&\mathbf {0} &\mathbf {0} \\\mathbf {0} &\mathbf {0} &\mathbf {0} &\mathbf {0} &0&1\\\mathbf {0} &\mathbf {0} &\mathbf {0} &\mathbf {0} &0&0\end{array}}\right]\in \mathbb {R} ^{(4d+2)\times (4d+2)},}

J = f x ( t n , y n ) a 1 = f ( t n , y n ) a 2 = f t ( t n , y n ) + 1 2 ∑ i = 1 m ( I ⊗ ( g i ( t n ) ) ⊺ ) f x x ( t n , y n ) g i ( t n ) {\displaystyle \mathbf {J} =\mathbf {f} _{\mathbf {x} }(t_{n},\mathbf {y} _{n})\qquad \mathbf {a} _{1}=\mathbf {f} (t_{n},\mathbf {y} _{n})\qquad \mathbf {a} _{2}=\mathbf {f} _{t}(t_{n},\mathbf {y} _{n})+{\frac {1}{2}}\sum \limits _{i=1}^{m}(\mathbf {I} \otimes (\mathbf {g} ^{i}(t_{n}))^{\intercal })\mathbf {f} _{\mathbf {xx} }(t_{n},\mathbf {y} _{n})\mathbf {g} ^{i}(t_{n})}

and

H 0 = G ( t n ) G ⊺ ( t n ) H 1 = G ( t n ) d G ⊺ ( t n ) d t + d G ( t n ) d t G ⊺ ( t n ) H 2 = d G ( t n ) d t d G ⊺ ( t n ) d t . {\displaystyle \mathbf {H} _{0}=\mathbf {G} (t_{n})\mathbf {G} ^{\intercal }(t_{n})\qquad \mathbf {H} _{1}=\mathbf {G} (t_{n}){\frac {d\mathbf {G} ^{\intercal }(t_{n})}{dt}}+{\frac {d\mathbf {G} (t_{n})}{dt}}\mathbf {G} ^{\intercal }(t_{n})\qquad \mathbf {H} _{2}={\frac {d\mathbf {G} (t_{n})}{dt}}{\frac {d\mathbf {G} ^{\intercal }(t_{n})}{dt}}{\text{.}}}

By construction, the weak LL discretizations inherit the stability and dynamics of the linear SDEs, but it is not the case of the weak LL schemes in general. WLL schemes, with p ≤ q ≤ p + 2 , {\displaystyle p\leq q\leq p+2,} preserve the first two moments of the linear SDEs, and inherits the mean-square stability or instability that such solution may have.cite-ref-11-24-2[24] This includes, for instance, the equations of coupled harmonic oscillators driven by random force, and large systems of stiff linear SDEs that result from the method of lines for linear stochastic partial differential equations. Moreover, these WLL schemes preserve the ergodicity of the linear equations, and are geometrically ergodic for some classes of nonlinear SDEs.cite-ref-6-26-0[26] For nonlinear SDEs with small noise (i.e., (8.1) with g i ( t ) ≈ 0 {\displaystyle \mathbf {g} _{i}(t)\approx 0} ), the solutions of these WLL schemes are basically the nonrandom paths of the LL scheme (4.6) for ODEs plus a small disturbance related to the small noise. In this situation, the dynamical properties of that deterministic scheme, such as the linearization preserving and the preservation of the exact solution dynamics around hyperbolic equilibrium points and periodic orbits, become relevant for the mean of the WLL scheme.cite-ref-11-24-3[24] For instance, Fig. 5 shows the approximate mean of the SDE

d x = − t 2 x d t + 3 2 ( t + 1 ) e − t 3 / 3 d w t , x ( 0 ) = 1 , ( 8.2 ) {\displaystyle dx=-t^{2}x{\text{ }}dt+{\frac {3}{2(t+1)}}e^{-t^{3}/3}{\text{ }}dw_{t},\qquad \qquad x(0)=1,\qquad \quad (8.2)}

computed by various schemes.

Below is a time line of the main developments of the Local Linearization (LL) method.

• Pope D.A. (1963) introduces the LL discretization for ODEs and the LL scheme based on Taylor expansion.cite-ref-18-2-1[2]

• Ozaki T. (1985) introduces the LL method for the integration and estimation of SDEs. The term "Local Linearization" is used for first time.cite-ref-19-27-0[27]

• Biscay R. et al. (1996) reformulate the strong LL method for SDEs.cite-ref-20-19-1[19]

• Shoji I. and Ozaki T. (1997) reformulate the weak LL method for SDEs.cite-ref-21-23-1[23]

• Hochbruck M. et al. (1998) introduce the LL scheme for ODEs based on Krylov subspace approximation.cite-ref-22-3-2[3]

• Jimenez J.C. (2002) introduces the LL scheme for ODEs and SDEs based on rational Padé approximation.cite-ref-23-21-2[21]

• Carbonell F.M. et al. (2005) introduce the LL method for RDEs.cite-ref-24-16-2[16]

• Jimenez J.C. et al. (2006) introduce the LL method for DDEs.cite-ref-13-11-3[11]

• De la Cruz H. et al. (2006, 2007) and Tokman M. (2006) introduce the two classes of HOLL integrators for ODEs: the integrator-based cite-ref-1-6-4[6] and the quadrature-based.cite-ref-17-7-1[7]cite-ref-2-5-7[5]

• De la Cruz H. et al. (2010) introduce strong HOLL method for SDEs.cite-ref-4-20-6[20]

cite-note-8-11. ↑ Jimenez J.C. (2009). "Local Linearization methods for the numerical integration of ordinary differential equations: An overview". ICTP Technical Report. 035: 357–373.

cite-note-18-22. ↑ Pope, D. A. (1963). "An exponential method of numerical integration of ordinary differential equations". Comm. ACM, 6(8), 491-493. doi:10.1145/366707.367592.

cite-note-22-33. ↑ Hochbruck, M., Lubich, C., & Selhofer, H. (1998). "Exponential integrators for large systems of differential equations". SIAM J. Scient. Comput. 19(5), 1552-1574. doi:10.1137/S1064827595295337.

cite-note-3-44. ↑ de la Cruz H.; Biscay R.J.; Jimenez J.C.; Carbonell F. (2013). "Local Linearization - Runge Kutta Methods: a class of A-stable explicit integrators for dynamical systems". Math. Comput. Modelling. 57 (3–4): 720–740. doi:10.1016/j.mcm.2012.08.011.

cite-note-2-55. ↑ de la Cruz H.; Biscay R.J.; Carbonell F.; Ozaki T.; Jimenez J.C. (2007). "A higher order Local Linearization method for solving ordinary differential equations". Appl. Math. Comput. 185: 197–212. doi:10.1016/j.amc.2006.06.096.

cite-note-1-66. ↑ de la Cruz H.; Biscay R.J.; Carbonell F.; Jimenez J.C.; Ozaki T. (2006). "Local Linearization-Runge Kutta (LLRK) methods for solving ordinary differential equations". Lecture Note in Computer Sciences 3991: 132–139, Springer-Verlag. doi:10.1007/11758501 22. ISBN 978-3-540-34379-0.

cite-note-17-77. ↑ Tokman M. (2006). "Efficient integration of large stiff systems of ODEs with exponential propagation iterative (EPI) methods". J. Comput. Physics. 213 (2): 748–776. doi:10.1016/j.jcp.2005.08.032.

cite-note-7-88. ↑ M. Hochbruck.; A. Ostermann. (2011). "Exponential multistep methods of Adams-type". BIT Numer. Math. 51 (4): 889–908. doi:10.1007/s10543-011-0332-6.

cite-note-25-99. ↑ Jimenez, J. C., & Carbonell, F. (2005). "Rate of convergence of local linearization schemes for initial-value problems". Appl. Math. Comput., 171(2), 1282-1295. doi:10.1016/j.amc.2005.01.118.

cite-note-1010. ↑ Carbonell F.; Jimenez J.C.; Pedroso L.M. (2008). "Computing multiple integrals involving matrix exponentials". J. Comput. Appl. Math. 213: 300–305. doi:10.1016/j.cam.2007.01.007.

cite-note-13-1111. ↑ Jimenez J.C.; Pedroso L.; Carbonell F.; Hernandez V. (2006). "Local linearization method for numerical integration of delay differential equations". SIAM J. Numer. Analysis. 44 (6): 2584–2609. doi:10.1137/040607356.

cite-note-12-1212. ↑ Jimenez J.C.; de la Cruz H. (2012). "Convergence rate of strong Local Linearization schemes for stochastic differential equations with additive noise". BIT Numer. Math. 52 (2): 357–382. doi:10.1007/s10543-011-0360-2.

cite-note-9-1313. ↑ Jimenez J.C.; Biscay R.; Mora C.; Rodriguez L.M. (2002). "Dynamic properties of the Local Linearization method for initial-value problems". Appl. Math. Comput. 126: 63–68. doi:10.1016/S0096-3003(00)00100-4.

cite-note-15-1414. ↑ Jimenez J.C.; Sotolongo A.; Sanchez-Bornot J.M. (2014). "Locally Linearized Runge Kutta method of Dormand and Prince". Appl. Math. Comput. 247: 589–606. doi:10.1016/j.amc.2014.09.001.

cite-note-16-1515. ↑ Naranjo-Noda, Jimenez J.C. (2021) "Locally Linearized Runge_Kutta method of Dormand and Prince for large systems of initial value problems." J.Comput. Physics. 426: 109946. doi:10.1016/j.jcp.2020.109946.

cite-note-24-1616. ↑ Carbonell, F., Jimenez, J. C., Biscay, R. J., & De La Cruz, H. (2005). "The local linearization method for numerical integration of random differential equations". BIT Num. Math. 45(1), 1-14. doi:10.1007/S10543-005-2645-9.

cite-note-10-1717. Jimenez J.C.; Carbonell F. (2009). "Rate of convergence of local linearization schemes for random differential equations". BIT Numer. Math. 49 (2): 357–373. doi:10.1007/s10543-009-0225-0.

cite-note-14-1818. ↑ Jimenez J.C, Shoji I., Ozaki T. (1999) "Simulación of stochastic differential equation through the local linearization method. A comparative study". J. Statist. Physics. 99: 587-602, doi:10.1023/A:1004504506041.

cite-note-20-1919. ↑ Biscay, R., Jimenez, J. C., Riera, J. J., & Valdes, P. A. (1996). "Local linearization method for the numerical solution of stochastic differential equations". Annals Inst. Statis. Math. 48(4), 631-644. doi:10.1007/BF00052324.

cite-note-4-2020. ↑ de la Cruz H.; Biscay R.J.; Jimenez J.C.; Carbonell F.; Ozaki T. (2010). "High Order Local Linearization methods: an approach for constructing A-stable high order explicit schemes for stochastic differential equations with additive noise". BIT Numer. Math. 50 (3): 509–539. doi:10.1007/s10543-010-0272-6.

cite-note-23-2121. ↑ Jimenez, J. C. (2002). "A simple algebraic expression to evaluate the local linearization schemes for stochastic differential equations". Appl. Math. Letters, 15(6), 775-780. doi:10.1016/S0893-9659(02)00041-1.

cite-note-5-2222. ↑ de la Cruz H.; Jimenez J.C.; Zubelli J.P. (2017). "Locally Linearized methods for the simulation of stochastic oscillators driven by random forces". BIT Numer. Math. 57: 123–151. doi:10.1007/s10543-016-0620-2.

cite-note-21-2323. ↑ Shoji, I., & Ozaki, T. (1997). "Comparative study of estimation methods for continuous time stochastic processes". J. Time Series Anal. 18(5), 485-506. doi:10.1111/1467-9892.00064.

cite-note-11-2424. ↑ Jimenez J.C.; Carbonell F. (2015). "Convergence rate of weak Local Linearization schemes for stochastic differential equations with additive noise". J. Comput. Appl. Math. 279: 106–122. doi:10.1016/j.cam.2014.10.021.

cite-note-0-2525. ↑ Carbonell F.; Jimenez J.C.; Biscay R.J. (2006). "Weak local linear discretizations for stochastic differential equations: convergence and numerical schemes". J. Comput. Appl. Math. 197: 578–596. doi:10.1016/j.cam.2005.11.032.

cite-note-6-2626. ↑ Hansen N.R. (2003) "Geometric ergodicity of discre-time approximations to multivariate diffusion". Bernoulli. 9 : 725-743, doi:10.3150/bj/1066223276.

cite-note-19-2727. ↑ Ozaki, T. (1985). "Non-linear time series models and dynamical systems". Handbook of statistics, 5, 25-83. doi:10.1016/S0169-7161(85)05004-0.